XML Representation of Constraint Networks: Format XCSP 2.1

نویسندگان

  • Olivier Roussel
  • Christophe Lecoutre
چکیده

We propose a new extended format to represent constraint networks using XML. This format allows us to represent constraints defined either in extension or in intension. It also allows us to reference global constraints. Any instance of the problems CSP (Constraint Satisfaction Problem), QCSP (Quantified CSP) and WCSP (Weighted CSP) can be represented using this format. A subset of this format will be used for the third international competition of CSP solvers which will be held during summer 2008 (deadline: May 10, 2008). The release of this document is January 15, 2008. 1 ar X iv :0 90 2. 23 62 v1 [ cs .A I] 1 3 Fe b 20 09

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving XCSP problems by using Gecode

Gecode is one of the most efficient libraries that can be used for constraint solving. However, using it requires dealing with C++ programming details. On the other hand several formats for representing constraint networks have been proposed. Among them, XCSP has been proposed as a format based on XML which allows us to represent constraints defined either extensionally or intensionally, permit...

متن کامل

XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems

We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated representations of combinatorial constrained problems. This new format is able to deal with mono/multi optimization, many types of variables, cost functions, reification, views, annotations, variable quantification, distributed, probabilistic and qualitative reasoning. The new format is made compact, highly re...

متن کامل

State of the Art Paper The Foundation for Semantic Interoperability on the World Wide Web

....................................................................................................................... 5 OVERVIEW ....................................................................................................................... 6 1. INTEROPERABILITY IN INFORMATION SYSTEMS.......................................................... 10 1.1 Definition.............................

متن کامل

Constraint Preserving XML Updating

With the rapid development of Internet, XML becomes the standard for data representation, integration and exchange on the web. In order to fully evolve XML into a universal data representation and sharing format, it is necessary to update XML documents efficiently while preserving constraints. We consider an important class of constraints, XML keys. In this paper, based on XML keys and the cons...

متن کامل

GQR – A Fast Reasoner for Binary Qualitative Constraint Calculi

GQR (Generic Qualitative Reasoner) is a solver for binary qualitative constraint networks. GQR takes a calculus description and one or more constraint networks as input, and tries to solve the networks using the path consistency method and (heuristic) backtracking. In contrast to specialized reasoners, it offers reasoning services for different qualitative calculi, which means that these calcul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0902.2362  شماره 

صفحات  -

تاریخ انتشار 2008